package leetcode;

import java.util.*;

/**
 * @program: datastructureandalogorithm
 * @description:
 * @author: hmx
 * @create: 2021-12-25 22:35
 **/
public class LeetCode5947 {

    public List<String> findAllRecipes(String[] recipes, List<List<String>> ingredients, String[] supplies) {
//        ArrayList<String> list = new ArrayList<>();
//        HashSet<String> set = new HashSet<>(Set.of(supplies));
//        for (int i = 0; i < recipes.length;) {
//            i += set.containsAll(ingredients.get(i)) && set.add(recipes[i]) && list.add(recipes[i]) ? -i : 1;
//        }
//        return list;

        return null;
    }

}
